Recursive algorithms for adaptive transversal filters: Optimality and time-variance

نویسنده

  • Gernot Kubin
چکیده

This thesis presents a unified theory for the design and analysis of recursive algorithms for the adaptation of transversal digital filters. First, the widely used error minimization approach to algorithm design is investigated and it is shown not to allow a coherent derivation of practical algorithms from an optimality criterion. The reason is found in the incompatibility of the assumption of a time-invariant application environment for the optimality definition and of the practical demand on the adaptive filter for tracking in timevarying environments. The present proposal for a deterministic approach to algorithm design goes beyond mere error minimization in that the time variation of the coefficients of the adaptive filter is included as well. In the sequel a wealth of algorithms is shown to fulfil this novel unified description and several algorithm modifications, which often appear ad hoc, are derived without invoking approximations. This covers also the utilization of error filters which is common practice in the adaptation of recursive filter structures. The second part of the thesis is devoted to the application of the described algorithm class to the tracking of time-varying environments. As a result, the tracking behaviour can be described as a filtering operation on the time evolution of the coefficients of a reference model which is imposed through the environment but not directly observable. Due to the general structure of the adaptation algorithms, this learning filter is always linear and of first order. To facilitate the incorporation of prior knowledge about the expected time evolution, the algorithm structure needs to be extended with so-called coefficient filters. This allows to tailor the tracking behaviour in response to practical demands as linear higher-order filtering or nonlinear filtering. In conclusion, a series of topical proposals for such coefficient filters is discussed on the basis of the accordingly extended unified optimality criterion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Transversal Recursive least-squares (FT-RLS) Algorithm

In this paper a brief overview of the Fast Transversal Recursive Least-Squares (FT-RLS) algorithm is provided. This algorithm is designed to provide similar performance to the standard RLS algorithm while reducing the computation order. This is accomplished by a combination of four transversal filters used in unison. Finite precision effects are also briefly discussed. Simulations are performed...

متن کامل

Lattice and QR Decomposition-Based Algorithms for Recursive Least Squares Adaptive Nonlinear Filters*

This paper presents a lattice structure for adaptive Volterra systems. The stucture is applicable to arbitrary planes of support of the Volterra kernels. A fast least squares lattice and a fast QR-lattice adaptive nonlinear filtering algorithms based on the lattice structure are also presented. These algorithms share the fast convergence property of fast least squares transversal Volterra filte...

متن کامل

Neural Networks and Nonlinear Adaptive Filtering: Unifying Concepts and New Algorithms

The paper proposes a general framework which encompasses the training of neural networks and the adaptation of filters. We show that neural networks can be considered as general non-linear filters which can be trained adaptively, i. e. which can undergo continual training with a possibly infinite number of time-ordered examples. We introduce the canonical form of a neural network. This canonica...

متن کامل

Multichannel recursive-least-square algorithms and fast-transversal-filter algorithms for active noise control and sound reproduction systems

In the last ten years, there has been much research on active noise control (ANC) systems and transaural sound reproduction (TSR) systems. In those fields, multichannel FIR adaptive filters are extensively used. For the learning of FIR adaptive filters, recursive-least-squares (RLS) algorithms are known to produce a faster convergence speed than stochastic gradient descent techniques, such as t...

متن کامل

Performance Considerations on Adaptive L-Filters

In this paper we will discuss some properties of adaptive order-statistic lters. The main objective is the analysis of two adaptive algorithms which are commonly used to update the lter coeecients and the comparison with their linear counterparts. Such a comparison is a useful tool to get approximate results about the behaviour of these algorithms. This is true because the structure of the solu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Signal Processing

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1990